On the Weak Generative Capacity of Weighted Context-free Grammars
نویسنده
چکیده
It is shown how weighted context-free grammars can be used to recognize languages beyond their weak generative capacity by a one-step constant time extension of standard recognition algorithms.
منابع مشابه
The Generative Power of Probabilistic and Weighted Context-Free Grammars
Over the last decade, probabilistic parsing has become the standard in the parsing literature where one of the purposes of those probabilities is to discard unlikely parses. We investigate the effect that discarding low probability parses has on both the weak and strong generative power of context-free grammars. We prove that probabilistic context-free grammars are more powerful than their non-...
متن کاملCombinatory Categorial Grammars: Generative Power and Relationship to Linear Context-Free Rewriting Systems
Recent results have established that there is a family of languages that is exactly the class of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammm~, Head Grammars, and Linear Indexed Grammars. In this paper we show that Combinatory Categorial Grammars also generates the same class of languages. We discuss the slruclm'al descriptions produced by Combi...
متن کاملDeductive Systems and Grammars: Proofs as Grammatical Structures
During the last fifteen years, much of the research of proof theoretical grammars has been focused on their weak generative capacity. This research culminated in Pentus’ theorem, which showed that Lambek grammars generate precisely the context-free languages. However, during the same period of time, research on other grammar formalisms has stressed the importance of “strong generative capacity,...
متن کاملThe Weak Generative Capacity of Linear Tree-Adjoining Grammars
Linear tree-adjoining grammars (TAGs), by analogy with linear context-free grammars, are treeadjoining grammars in which at most one symbol in each elementary tree can be rewritten (adjoined or substituted at). Uemura et al. (1999), calling these grammars simple linear TAGs (SLTAGs), show that they generate a class of languages incommensurate with the context-free languages, and can be recogniz...
متن کاملComputational Aspects of M-grammars
In this paper M-grammars tha t are used in the Roset ta t ranslat ion system will be looked at as the specification of a t t r ibu te grammars. We will show tha t the a t t r ibute evaluation order is such tha t instead of the special-purpose parsing and generation algorithms introduced for M-grammars in Appelo et al.(1987), also Earley-like context-free parsing and ordinary generation strategi...
متن کامل